Survey of Parallel Volume Rendering Algorithms
نویسنده
چکیده
Volume rendering is a compute and memory intensive application. Researchers have attempted to use parallel computers to speed up volume rendering for interactive frame rates. Many architectures and approaches have been developed. I develop a taxonomy of volume rendering by forming ve categories: algorithm control ow, targeted hardware, application data characteristics, visualization method, and publication speci cs. I discuss the current approaches in parallel volume rendering algorithms, and show how di erent taxonomies from the developed classi cation provide the ability to compare, contrast, and show potential for future research results.
منابع مشابه
Designing Optimal Parallel Volume Rendering Algorithms
Designing Optimal Parallel Volume Rendering Algorithms by Craig Michael Wittenbrink Chairperson of the Supervisory Committee: Professor Arun K. Somani Department of Electrical Engineering and Department of Computer Science and Engineering Volume rendering is a method for visualizing volumes of sampled data such as CT, MRI, and finite element simulations. Visualization of medical and simulation ...
متن کاملVolume Viewing Algorithms: Survey
c s The task of the rendering process is to display the primitives used to represent the 3D volumetri cene onto a 2D screen. Rendering is composed of a viewing process which is the subject of this paper, b and the shading process. The projection process determines, for each screen pixel, which objects are seen y the sight ray cast from this pixel into the scene. The viewing algorithm is heavily...
متن کاملClassification and Survey of Algorithms for Volume Viewing
c s The task of the rendering process is to display the primitives used to represent the 3D volumetri cene onto a 2D screen. Rendering is composed of a viewing process which is the subject of this paper, b and the shading process. The projection process determines, for each screen pixel, which objects are seen y the sight ray cast from this pixel into the scene. The viewing algorithm is heavily...
متن کاملParallel Volume Rendering with Sparse Data Structures
Direct volume rendering is a popular technique for scientifc visualization. The computation cost of direct volume rendering increases exponentially as the size of the volume dataset increases. Hence, efficient volume rendering has become an important issue. In this work, we study parallel volume rendering algorithms based on sparse data structures. In order to exploit object space coherence, we...
متن کاملMassively Parallel Visualization: Parallel Rendering
This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume renderer use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 MPP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998